Automatic generation produced by ISE Eiffel

ClassesClustersCluster hierarchyChartRelationsTextContracts
class MP3_DIRECTORY [G] General cluster: root_cluster description: "Class working as a container for mp3-files" create: make_with_name Ancestors LINKED_LIST [G] Queries after: BOOLEAN -- (from LINKED_LIST) before: BOOLEAN -- (from LINKED_LIST) changeable_comparison_criterion: BOOLEAN -- (from CONTAINER) count: INTEGER -- (from LINKED_LIST) cursor: CURSOR -- (from LINKED_LIST) duplicate (n: INTEGER): [like Current] MP3_DIRECTORY [G] -- (from DYNAMIC_CHAIN) exhausted: BOOLEAN -- (from LINEAR) Extendible: BOOLEAN -- (from DYNAMIC_CHAIN) first: [like item] G -- (from LINKED_LIST) for_all (test: FUNCTION [ANY, TUPLE [G], BOOLEAN]): BOOLEAN -- (from LINEAR) Full: BOOLEAN -- (from LINKED_LIST) has (v: [like item] G): BOOLEAN -- (from CHAIN) i_th (i: INTEGER): [like item] G -- (from CHAIN) index: INTEGER -- (from LINKED_LIST) index_of (v: [like item] G; i: INTEGER): INTEGER -- (from CHAIN) index_set: INTEGER_INTERVAL -- (from CHAIN) infix "@" (i: INTEGER): [like item] G -- (from CHAIN) is_empty: BOOLEAN -- (from FINITE) is_equal (other: [like Current] MP3_DIRECTORY [G]): BOOLEAN -- (from LIST) is_inserted (v: G): BOOLEAN -- (from LINKED_LIST) isfirst: BOOLEAN -- (from LINKED_LIST) islast: BOOLEAN -- (from LINKED_LIST) item: G -- (from LINKED_LIST) last: [like item] G -- (from LINKED_LIST) linear_representation: LINEAR [G] -- (from LINEAR) name: STRING object_comparison: BOOLEAN -- (from CONTAINER) occurrences (v: [like item] G): INTEGER -- (from CHAIN) off: BOOLEAN -- (from LINKED_LIST) prunable: BOOLEAN -- (from DYNAMIC_CHAIN) readable: BOOLEAN -- (from LINKED_LIST) sequential_occurrences (v: G): INTEGER -- (from LINEAR) there_exists (test: FUNCTION [ANY, TUPLE [G], BOOLEAN]): BOOLEAN -- (from LINEAR) valid_cursor (p: CURSOR): BOOLEAN -- (from LINKED_LIST) valid_cursor_index (i: INTEGER): BOOLEAN -- (from CHAIN) valid_index (i: INTEGER): BOOLEAN -- (from CHAIN) writable: BOOLEAN -- (from SEQUENCE) Commands append (s: SEQUENCE [G]) -- (from CHAIN) back -- (from LINKED_LIST) compare_objects -- (from CONTAINER) compare_references -- (from CONTAINER) copy (other: [like Current] MP3_DIRECTORY [G]) -- (from LINKED_LIST) do_all (action: PROCEDURE [ANY, TUPLE [G]]) -- (from LINEAR) do_if (action: PROCEDURE [ANY, TUPLE [G]]; test: FUNCTION [ANY, TUPLE [G], BOOLEAN]) -- (from LINEAR) extend (v: [like item] G) -- (from LINKED_LIST) fill (other: CONTAINER [G]) -- (from CHAIN) finish -- (from LINKED_LIST) force (v: [like item] G) -- (from SEQUENCE) forth -- (from LINKED_LIST) go_i_th (i: INTEGER) -- (from LINKED_LIST) go_to (p: CURSOR) -- (from LINKED_LIST) make -- (from LINKED_LIST) make_with_name (artist: STRING) merge_left (other: [like Current] MP3_DIRECTORY [G]) -- (from LINKED_LIST) merge_right (other: [like Current] MP3_DIRECTORY [G]) -- (from LINKED_LIST) move (i: INTEGER) -- (from LINKED_LIST) prune (v: [like item] G) -- (from DYNAMIC_CHAIN) prune_all (v: [like item] G) -- (from DYNAMIC_CHAIN) put (v: [like item] G) -- (from CHAIN) put_front (v: [like item] G) -- (from LINKED_LIST) put_i_th (v: [like item] G; i: INTEGER) -- (from CHAIN) put_left (v: [like item] G) -- (from LINKED_LIST) put_right (v: [like item] G) -- (from LINKED_LIST) remove -- (from LINKED_LIST) remove_left -- (from LINKED_LIST) remove_right -- (from LINKED_LIST) replace (v: [like item] G) -- (from LINKED_LIST) search (v: [like item] G) -- (from BILINEAR) start -- (from LINKED_LIST) swap (i: INTEGER) -- (from CHAIN) wipe_out -- (from LINKED_LIST) Constraints name not void
ClassesClustersCluster hierarchyChartRelationsTextContracts

-- Generated by ISE Eiffel --

For more details: www.eiffel.com